A Counterexample to a Conjecture of S.e. Morris

نویسندگان

  • S. E. Morris
  • J. F. Feinstein
چکیده

We give a counterexample to a conjecture of S.E. Morris by showing that there is a compact plane set X such that R(X) has no non-zero, bounded point derivations but such that R(X) is not weakly amenable. We also give an example of a separable uniform algebra A such that every maximal ideal of A has a bounded approximate identity but such that A is not weakly amenable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

An explicit counterexample to the Lagarias-Wang finiteness conjecture

The joint spectral radius of a finite set of real d × d matrices is defined to be the maximum possible exponential rate of growth of long products of matrices drawn from that set. A set of matrices is said to have the finiteness property if there exists a periodic product which achieves this maximal rate of growth. J. C. Lagarias and Y. Wang conjectured in 1995 that every finite set of real d× ...

متن کامل

A 64-Dimensional Counterexample to Borsuk's Conjecture

Bondarenko’s 65-dimensional counterexample to Borsuk’s conjecture contains a 64-dimensional counterexample. It is a two-distance set of 352 points.

متن کامل

A polynomial counterexample to the Markus-Yamabe Conjecture

We give a polynomial counterexample to both the Markus-Yamabe Conjecture and the discrete Markus-Yamabe problem for all dimensions ≥ 3.

متن کامل

On a Coloring Conjecture of Hajós

Hajós conjectured that graphs containing no subdivision of K5 are 4-colorable. It is shown in [15] that if there is a counterexample to this conjecture then any minimum such counterexample must be 4-connected. In this paper, we further show that if G is a minimum counterexample to Hajós’ conjecture and S is a 4-cut in G then G− S has exactly two components. AMS Subject Classification: 05C15, 05...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008